Strict Maximum Separability of Two Finite Sets: an Algorithmic Approach

نویسنده

  • DOROTA CENDROWSKA
چکیده

The paper presents a recursive algorithm for the investigation of a strict, linear separation in the Euclidean space. In the case when sets are linearly separable, it allows us to determine the coefficients of the hyperplanes. An example of using this algorithm as well as its drawbacks are shown. Then the algorithm of determining an optimal separation (in the sense of maximizing the distance between the two sets) is presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On linear separability of data sets in feature space

In this paper we focus our topic on linear separability of two data sets in feature space, including finite and infinite data sets. We first develop a method to construct a mapping that maps original data set into a high dimensional feature space, on which inner product is defined by a dot product kernel. Our method can also be applied to the Gaussian kernels. Via this mapping, structure of fea...

متن کامل

Maximum Tolerance and Maximum Greatest Tolerance

An important consideration when applying neural networks is the sensitivity to weights and threshold in strict separating systems representing a linearly separable function. Two parameters have been introduced to measure the relative errors in weights and threshold of strict separating systems: the tolerance and the greatest tolerance. Given an arbitrary separating system we study which is the ...

متن کامل

Max-min separability: incremental approach and application to supervised data classification

A new algorithm for the computation of a piecewise linear function separating two finite point sets in n-dimensional space is developed and the algorithm is applied to solve supervised data classification problems. The algorithm computes hyperplanes incrementally and it finds as many hyperplanes as necessary to separate two sets with respect to some tolerance. An error function is formulated an...

متن کامل

Maximum Allowable Dynamic Load of Flexible 2-Link Mobile Manipulators Using Finite Element Approach

In this paper a general formulation for finding the maximum allowable dynamic load (MADL) of flexible link mobile manipulators is presented. The main constraints used for the algorithm presented are the actuator torque capacity and the limited error bound for the end-effector during motion on the given trajectory. The precision constraint is taken into account with two boundary lines in plane w...

متن کامل

Separating objects in the plane by wedges and strips

In this paper we study the separability of two disjoint sets of objects in the plane according to two criteria: wedge separability and strip separability. We give algorithms for computing all the separating wedges and strips, the wedges with the maximum and minimum angle, and the narrowest and the widest strip. The objects we consider are points, segments, polygons and circles. As applications,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005